Gene duplication and the birthday problem
نویسندگان
چکیده
منابع مشابه
The multiple gene duplication problem revisited
MOTIVATION Deciphering the location of gene duplications and multiple gene duplication episodes on the Tree of Life is fundamental to understanding the way gene families and genomes evolve. The multiple gene duplication problem provides a framework for placing gene duplication events onto nodes of a given species tree, and detecting episodes of multiple gene duplication. One version of the mult...
متن کاملOn the Multiple Gene Duplication Problem
A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of (possibly contradictory) gene trees. In recent literature, the Duplication/ Loss model has received considerable attention. Here one measures the similarity/dissimilarity between a set of gene trees by counting the number of paralogous gene duplications and subsequent...
متن کاملThe Birthday Problem and Generalizations
The question that we began our comps process with, the Birthday Problem, is a relatively basic problem explored in elementary probability courses. To solve it, we find the probability that in a group of n people, two of them share the same birthday. The reason this problem is intriguing is that the probability values that we get as a result of our solution are much different that what one may e...
متن کاملScaling the Gene Duplication Problem Towards the Tree of Life
The gene duplication problem seeks the species tree that implies the fewest duplications across a collection of gene trees. We describe two new improvements to existing heuristics that greatly accelerate the rSPR local search. The improvements involve (i) reducing the computational complexity by Θ(n/h) for sequential evaluations of the reconciliation cost on n taxa and a tree height of h, and (...
متن کاملA Generalized Birthday Problem
We study a k-dimensional generalization of the birthday problem: given k lists of n-bit values, find some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely well-known birthday problem, which has a square-root time algorithm with many applications in cryptography. In this paper, we show new algorithms for the case k > 2: we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1982
ISSN: 0028-0836,1476-4687
DOI: 10.1038/296176a0